Well-Pointed Coalgebras

نویسندگان

  • Jirí Adámek
  • Stefan Milius
  • Lawrence S. Moss
  • Lurdes Sousa
چکیده

For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Osius [20] and Taylor [27]. Finally, the initial iterative algebra consists of all finite well-pointed coalgebras. Numerous examples are discussed e.g. automata, graphs, and labeled transition systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Well-Pointed Coalgebras (Extended Abstract)

For set functors preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper subobject and no proper quotient. And the initial algebra consists of all well-pointed coalgebras that are well-founded in the sense of Taylor [16]. Finally, the initial ite...

متن کامل

Homotopy Theory of Coalgebras over Operads

This paper constructs model structures on the categories of coalgebras and pointed irreducible coalgebras over an operad whose components are projective, finitely generated in each dimension, and satisfy a condition that allows one to take tensor products with a unit interval. The underlying chain-complex is assumed to be unbounded and the results for bounded coalgebras over an operad are deriv...

متن کامل

Automata and fixed point logic: A coalgebraic perspective

This paper generalizes existing connections between automata and logic to a coalgebraic abstraction level. Let F : Set→ Set be a standard functor that preserves weak pullbacks. We introduce various notions of F-automata, devices that operate on pointed F-coalgebras. The criterion under which such an automaton accepts or rejects a pointed coalgebra is formulated in terms of an infinite two-playe...

متن کامل

F eb 2 00 8 PRIME PATH COALGEBRAS

We use prime coalgebras as a generalization of simple coalgebras, and observe that prime subcoalgebras represent the structure of the coalgebra in a more efficient way than simple coalgebras. In particular, in this work we focus our attention on the study and characterization of prime subcoalgebras of path coalgebras of quivers and, by extension, of prime pointed coalgebras. It is well known th...

متن کامل

Model-categories of Coalgebras over Operads

This paper constructs model structures on the categories of coalgebras and pointed irreducible coalgebras over an operad whose components are projective, finitely generated in each dimension, and satisfy a condition that allows one to take tensor products with a unit interval. The underlying chain-complex is assumed to be unbounded and the results for bounded coalgebras over an operad are deriv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logical Methods in Computer Science

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2011